Primitive Element Theorem
The proof of this theorem is constructive. As such, we will prove the simple case, with two known generator of , showing exactly how the primitive element can be calculated, and then prove the general result by induction.
Lemma
Let be a finite, separable field extension (that is, and are algebraic over with minimal polynomials that have no repeated roots).
Let be the conjugates of and be the conjugates of with and .
If satisfies
for all and , then
Proof
Let be a finite extension and let and be the minimal polynomials over over and respectively.
Let be the conjugates of (the roots of ) and be the conjugates of (the roots of ) with and .
Now, let be such that
for all and .
Such a exists because there are only finitely many equations, and and unless or is zero, a trivial case.
Notice that and therefore . Hence is a root of and . This is the only common root since has only roots of the form , and if is a root of then (since are only roots of ) for some , a contradiction unless .
Therefore and has a unique common root, .
Let be the minimal polynomial of over , and consider and as polynomials in . Since the minimal polynomial divides any polynomial with has the same root, we can deduce that
This means that is linear, since the two polynomials only have one common root and neither have repeated roots because we are working over a separable extension. Since is monic, we can then conclude that which is in and thus .
With we have that , and hence . The other inclusion follows simply because .